The Plank Problem for Symmetric Bodies
نویسنده
چکیده
Given a symmetric convex body C and n hyperplanes in an Euclidean space, there is a translate of a multiple of C, at least 1 n+1 times as large, inside C, whose interior does not meet any of the hyperplanes. The result generalizes Bang's solution of the plank problem of Tarski and has applications to Diophantine approximation.
منابع مشابه
New Solutions for Fokker-Plank Equation of Special Stochastic Process via Lie Point Symmetries
In this paper Lie symmetry analysis is applied in order to find new solutions for Fokker Plank equation of Ornstein-Uhlenbeck process. This analysis classifies the solutions format of the Fokker Plank equation by using the Lie algebra of the symmetries of our considered stochastic process.
متن کاملPlank Theorems via Successive Inradii
In the 1930’s, Tarski introduced his plank problem at a time when the field discrete geometry was about to born. It is quite remarkable that Tarski’s question and its variants continue to generate interest in the geometric as well as analytic aspects of coverings by planks in the present time as well. Besides giving a short survey on the status of the affine plank conjecture of Bang (1950) we p...
متن کاملSome results on the symmetric doubly stochastic inverse eigenvalue problem
The symmetric doubly stochastic inverse eigenvalue problem (hereafter SDIEP) is to determine the necessary and sufficient conditions for an $n$-tuple $sigma=(1,lambda_{2},lambda_{3},ldots,lambda_{n})in mathbb{R}^{n}$ with $|lambda_{i}|leq 1,~i=1,2,ldots,n$, to be the spectrum of an $ntimes n$ symmetric doubly stochastic matrix $A$. If there exists an $ntimes n$ symmetric doubly stochastic ...
متن کاملAn improved infeasible interior-point method for symmetric cone linear complementarity problem
We present an improved version of a full Nesterov-Todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (Bull. Iranian Math. Soc., 40(3), 541-564, (2014)). In the earlier version, each iteration consisted of one so-called feasibility step and a few -at most three - centering steps. Here, each iteration consists of only a feasibility step. Thus, the new...
متن کاملA full NT-step O(n) infeasible interior-point method for Cartesian P_*(k) –HLCP over symmetric cones using exponential convexity
In this paper, by using the exponential convexity property of a barrier function, we propose an infeasible interior-point method for Cartesian P_*(k) horizontal linear complementarity problem over symmetric cones. The method uses Nesterov and Todd full steps, and we prove that the proposed algorithm is well define. The iteration bound coincides with the currently best iteration bound for the Ca...
متن کامل